Compositions with Parts Constrained by the Leading Summand

نویسنده

  • ARNOLD KNOPFMACHER
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Concave Compositions

Concave compositions are compositions (i.e. ordered partitions) of a number in which the parts decrease up to the middle summand(s) and increase thereafter. Perhaps the most surprising result is for even length, concave compositions where the generating function turns out to be the quotient of two instances of the pentagonal number theorem with variations of sign. The false theta function disco...

متن کامل

Integer Sequences Related to Compositions without 2’s

A composition of a positive integer n consists of an ordered sequence of positive integers whose sum is n. We investigate compositions in which the summand 2 is not allowed, and count the total number of such compositions and the number of occurrences of the summand i in all such compositions. Furthermore, we explore patterns in the values for Cj(n, 2̂), the number of compositions of n without 2...

متن کامل

Symmetrically Constrained Compositions

Given integers a1, a2, . . . , an, with a1 + a2 + · · ·+ an ≥ 1, a symmetrically constrained composition λ1 + λ2 + · · ·+ λn =M of M into n nonnegative parts is one that satisfies each of the the n! constraints {∑n i=1 aiλπ(i) ≥ 0 : π ∈ Sn } . We show how to compute the generating function of these compositions, combining methods from partition theory, permutation statistics, and lattice-point ...

متن کامل

Probabilistic Analysis of Carlitz Compositions

Using generating functions and limit theorems, we obtain a stochastic description of Carlitz compositions of large integer n (i.e. compositions two successive parts of which are different). We analyze: the number M of parts, the number of compositions T (m,n) with m parts, the distribution of the last part size, the correlation between two successive parts, leading to a Markov chain. We describ...

متن کامل

The Frequency of Summands of a Particular Size in Palindromic Compositions

A composition of a positive integer n consists of an ordered sequence of positive integers whose sum is n. A palindromic composition is one for which the sequence is the same from left to right as from right to left. This paper shows various ways of generating all palindromic compositions, counts the number of times each integer appears as a summand among all the palindromic compositions of n, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007